Note on translated sum on primitive sequences
نویسندگان
چکیده
In this note, we construct a new set \boldsymbol{S} of primitive sets such that for any real number x\geq 60 get: \begin{equation*} \sum\limits_{a\in \mathcal{A}}\frac{1}{a(\log a+x)}>\sum\limits_{p\in \mathcal{P}}\frac{1}{p(\log p+x)},\text{ }\mathcal{A\in }{\boldsymbol{S}}, \end{equation*} where \mathcal{P} denotes the prime numbers.
منابع مشابه
Note on regular and coregular sequences
Let R be a commutative Noetherian ring and let M be a nitely generated R-module. If I is an ideal of R generated by M-regular sequence, then we study the vanishing of the rst Tor functors. Moreover, for Artinian modules and coregular sequences we examine the vanishing of the rst Ext functors.
متن کاملA Note on Chromatic Sum
The chromatic sum Σ(G) of a graph G is the smallest sum of colors among of proper coloring with the natural number. In this paper, we introduce a necessary condition for the existence of graph homomorphisms. Also, we present Σ(G) < χf (G)|G| for every graph G.
متن کاملA Further Note on Runs in Independent Sequences
Given a sequence of letters generated independently from a finite alphabet, we consider the case when more than one, but not all, letters are generated with the highest probability. The length of the longest run of any of these letters is shown to be one greater than the length of the longest run in a particular state of an associated Markov chain. Using results of Foulser and Karlin (19...
متن کاملOn an Extremal Problem concerning Primitive Sequences
A sequence a,< . . . of integers is called primitive if no a divides any other . (a 1 < . . . will always denote a primitive sequence .) It is easy to see that if a i < . . . < a,,, < n then max k = [(n + 1) /2] . The following question seems to be very much more difficult . Put f(n) =niax E 1) , a,, where the maximum is taken over all primitive sequences all of wliose terms are not exceeding n...
متن کاملNote on a Zero-Sum Problem
Let G be an additively written, finite abelian group, and exp(G ) its exponent. Let S=(a1 , ..., ak) be a sequence of elements in G; we say that S is a zero-sum sequence if i=1 ai=0. Let s(G ) be the samllest integer t such that every sequence of t elements in G contains a zero-sum subsequence of length exp(G ). This constant has been studied by serveral authors during last 20 years [1 9, 11]. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notes on Number Theory and Discrete Mathematics
سال: 2021
ISSN: ['1310-5132', '2367-8275']
DOI: https://doi.org/10.7546/nntdm.2021.27.3.39-43